Improved Basic Block Reordering
نویسندگان
چکیده
منابع مشابه
Basic-block Reordering Using Neural Networks
Basic-block reordering is a compiler optimization technique which has the effect of reducing branch cost and I-Cache misses by rearranging code layout. In this paper, we present our basic-block reordering method which detects typical structures in the control-flow graph. It uses the architecture-specific branch cost model and execution possibilities of control-flow edges to estimate the possibl...
متن کاملBlock-Restricted Reordering - Extended Experiments
Ordered Binary Decision Diagrams (OBDDs) are so far the most eecient representation scheme for manipulation of Boolean functions in computer-aided design and veriication of digital systems. The concise-ness of an OBDD representation depends on the choice of the variable ordering, and the minimization problem that can be formulated as the problem of nding an ordering that minimizse the OBDD size...
متن کاملAnalysis of Basic Data Reordering Techniques
Data reordering techniques are applied to improve the space and time efficiency of storage and query systems in various scientific and commercial applications. Run-length encoding is a prominent approach of compression in many areas, whose performance is significantly enhanced by achieving longer and fewer “runs” through data reordering. In this paper we theoretically study two reordering techn...
متن کاملGeneralized Reordering Rules for Improved SMT
We present a simple yet effective approach to syntactic reordering for Statistical Machine Translation (SMT). Instead of solely relying on the top-1 best-matching rule for source sentence preordering, we generalize fully lexicalized rules into partially lexicalized and unlexicalized rules to broaden the rule coverage. Furthermore, , we consider multiple permutations of all the matching rules, a...
متن کاملCircus: Opportunistic Block Reordering for Scalable Content Servers
Whole-file transfer is a basic primitive for Internet content dissemination. Content servers are increasingly limited by disk arm movement given the rapid growth in disk density, disk transfer rates, server network bandwidth, and content size. Individual file transfers are sequential, but the block access sequence on a content server is effectively random when many slow clients access large fil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2020
ISSN: 0018-9340,1557-9956,2326-3814
DOI: 10.1109/tc.2020.2982888